Forcings constructed along morasses
نویسنده
چکیده
In a previous paper [11], we introduced a way of constructing a forcing along a simplified (κ, 1)-morass such that the forcing satisfies a chain condition. The basic idea is to generalize iterated forcing with finite support as introduced by Solovay and Tennenbaum, which works with continuous, commutative systems of complete embeddings. However, instead of considering a linear system of embeddings, we take a two-dimensional system. These two-dimensional systems behave in some ways like forcing iterations, in other respects they do not. In the present paper, the theory of these higher-dimensional systems is further developed. We generalize the approach of [11] to three-dimensional systems constructed along simplified (κ, 2)-morasses. Moreover, we observe that the forcings obtained in these twoor three-dimensional constructions are usually equivalent to the respective forcing constructed along a subsystem of size κ. An immediate consequence of this and [11] is: If there is a simplified (ω1, 1)-morass, then there exists a ccc forcing of size ω1 that adds an ω2-Suslin tree. The main result is: If there is a simplified (ω1, 2)-morass, then there exists a ccc forcing of size ω1 that adds a 0-dimensional Hausdorff topology τ on ω3 which has spread s(τ ) = ω1. By a theorem of Hajnal and Juhasz, card(X) ≤ 2 s(X) holds for all Hausdorff spaces X. Since a forcing as ours preserves GCH , our result answers the open question if card(X) = 2 s(X) is consistent for a regular space X with s(X) = ω1. However, there are many statements about ω2 whose consistency one would naturally prove with a ccc forcing but which contradict GCH . Therefore, we will also discuss how to change our approach so that this becomes possible. As an example, we construct a ccc forcing which adds a chain 〈Xα | α < ω2〉 such thatXα ⊆ ω1, Xβ−Xα is finite andXα−Xβ has size ω1 for all β < α < ω2. Such a forcing was first found by Koszmider using only 2.
منابع مشابه
Higher-dimensional Forcing
We present a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along ω1 is given. Then its direct limit satisfies ccc by a well-known theorem on finite support iterations. However, this limit has size at most ω1. To get larger forcings, we do not consider linear systems but higher-dimensional system...
متن کاملSuperatomic Boolean Algebras Constructed from Morasses
By using the notion of a simplified (n, 1)-morass, we construct n-thin-tall, K-thin-thick and, in a forcing extension, K-very thin-thick superatomic Boolean algebras for every infinite regular cardinal n.
متن کاملLarge cardinals and gap-1 morasses
We present a new partial order for directly forcing morasses to exist that enjoys a significant homogeneity property. We then use this forcing in a reverse Easton iteration to obtain an extension universe with morasses at every regular uncountable cardinal, while preserving all n-superstrong (1 ≤ n ≤ ω), hyperstrong and 1-extendible cardinals. In the latter case, a preliminary forcing to make t...
متن کاملMorasses and Finite Support Iterations
We introduce a method of constructing a forcing along a simplified (κ, 1)-morass such that the forcing satisfies the κ-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain condition. As an application, we construct a ccc forcing that adds an ω2-Suslin tree. Related methods are Shelah’s historic forcing and Todorcevic’s ρ-functions.
متن کاملThe Κ-antichain Property for (κ, 1)-simplified Morasses
We discuss Shelah, Väänänen and Veli£kovi¢'s recently introduced κ-antichain property for (κ, 1)-simpli ed morasses. We give a streamlined characterization of the property, and show how the property can be destroyed by forcing and hence that it is consistent that no (ω, 1)-simpli ed morasses have the property. We brie y touch on the combination of the antichain property with complete amalgamati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 76 شماره
صفحات -
تاریخ انتشار 2011